Deciding Confluence of Ground Term Rewrite Systems in Cubic Time
نویسنده
چکیده
It is well known that the confluence property of ground term rewrite systems (ground TRSs) is decidable in polynomial time. For an efficient implementation, the degree of this polynomial is of great interest. The best complexity bound in the literature is given by Comon, Godoy and Nieuwenhuis (2001), who describe an O(n5) algorithm, where n is the size of the ground TRS. In this paper we improve this bound to O(n3). The algorithm has been implemented in the confluence tool CSI. 1998 ACM Subject Classification F.4.2 Grammars and Other Rewriting Systems – Decision problems
منابع مشابه
Deciding Confluence and Normal Form Properties of Ground Term Rewrite Systems Efficiently
It is known that the first-order theory of rewriting is decidable for ground term rewrite systems, but the general technique uses tree automata and often takes exponential time. For many properties, including confluence (CR), uniqueness of normal forms with respect to reductions (UNR) and with respect to conversions (UNC), polynomial time decision procedures are known for ground term rewrite sy...
متن کاملDeciding Confluence of Certain Term Rewriting Systems in Polynomial Time
We present a polynomial time algorithm for deciding confluence of ground term rewrite systems. We generalize the decision procedure to get a polynomial time algorithm, assuming that the maximum arity of a symbol in the signature is a constant, for deciding confluence of rewrite systems where each rule contains a shallow linear term on one side and a ground term on the other. The existence of a ...
متن کاملThe Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time
The confluence property of ground (i.e., variable-free) term rewrite systems (GTRS) is well-known to be decidable. This was proved independently in [4, 3] and in [13] using tree automata techniques and ground tree transducer techniques (originated from this problem), yielding EXPTIME decision procedures (PSPACE for strings). Since then, it has been a well-known longstanding open question whethe...
متن کاملDeciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure
Right-(ground or variable) rewrite systems (RGV systems for short) are term rewrite systems where all right hand sides of rules are restricted to be either ground or a variable. We define a minimal rewrite extensionR of the rewrite relation induced by a RGV system R. This extension admits a rewrite closure presentation, which can be effectively constructed from R. The rewrite closure is used to...
متن کاملConfluence of Shallow Right-Linear Rewrite Systems
We show that confluence of shallow and right-linear term rewriting systems is decidable. This class of rewriting system is expressive enough to include nontrivial nonground rules such as commutativity, identity, and idempotence. Our proof uses the fact that this class of rewrite systems is known to be regularity-preserving, which implies that its reachability and joinability problems are decida...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012